منابع مشابه
Delay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems
In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...
متن کاملAsymptotically Globally Stable Multiwindow Controllers
The Popov criterion is applied to control system analysis and design. Nonlinear dynamic compensators (NDC) are int reduced which ensure absolute stability without penalizing the available feedback. 1 Multiwindow Controllers and Nonlinear Dynamic Compensation Ivlultiwindow controllers consisting of linear controllers with nonlinear windows [1,2] perform superior to linear controllers. They can b...
متن کاملFixed Points of Asymptotically Regular Nonexpansive Mappings on Nonconvex Sets
It is shown that if X is a Banach space and C is a union of finitely many nonempty, pairwise disjoint, closed, and connected subsets {Ci : 1≤ i≤ n} of X , and each Ci has the fixed-point property (FPP) for asymptotically regular nonexpansive mappings, then any asymptotically regular nonexpansive self-mapping of C has a fixed point. We also generalize the Goebel-Schöneberg theorem to some Banach...
متن کاملEvolutionary Origin of Asymptotically Stable Consensus
Consensus is widely observed in nature as well as in society. Up to now, many works have focused on what kind of (and how) isolated single structures lead to consensus, while the dynamics of consensus in interdependent populations remains unclear, although interactive structures are everywhere. For such consensus in interdependent populations, we refer that the fraction of population adopting a...
متن کاملAsymptotically Optimal Hitting Sets Against Polynomials
Our main result is an efficient construction of a hitting set generator against the class of polynomials of degree di in the i-th variable. The seed length of this generator is logD + O (̃logD). Here, logD = ∑ i log(di + 1) is a lower bound bound on the seed length of any hitting set generator against this class. Our construction is the first to achieve asymptotically optimal seed length for eve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 1970
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091500009469